On the variance of the random sphere of influence graph
نویسندگان
چکیده
We show that the variance of the number of edges in the random sphere of innuence graph built on n i.i.d. sites which are uniformly distributed over the unit cube in R d , grows linearly with n. This is then used to establish a central limit theorem for the number of edges in the random sphere of innuence graph built on a Poisson number of sites. Some related proximity graphs are discussed as well.
منابع مشابه
Spatial statistics for lattice points on the sphere I: Individual results
We study the spatial distribution of point sets on the sphere obtained from the representation of a large integer as a sum of three integer squares. We examine several statistics of these point sets, such as the electrostatic potential, Ripley's function, the variance of the number of points in random spherical caps, and the covering radius. Some of the results are conditional on t...
متن کاملOn a sphere of influence graph in a one-dimensional space
A sphere of influence graph generated by a finite population of generated points on the real line by a Poisson process is considered. We determine the expected number and variance of societies formed by population of n points in a one-dimensional space.
متن کاملOn the Variance-Type Graph Irregularity Measures
Bell's degree-variance Var$!{}_{B}$ for a graph $G$, with the degree sequence ($d_1,d_2,cdots,d_n$) and size $m$, is defined as$Var!_{B} (G)=frac{1}{n} sum _{i=1}^{n}left[d_{i} -frac{2m}{n}right]^{2}$.In this paper, a new version of the irregularity measures of variance-type, denoted by $Var_q$, is introduced and discussed. Based on a comparative study, it is demonstrated that the n...
متن کاملInvestigation of pore-scale random porous media using lattice boltzmann method
The permeability and tortuosity of pore-scale two and three-dimensional random porous media were calculated using the Lattice Boltzmann method (LBM). Effects of geometrical parameters of medium on permeability and tortuosity were investigated as well. Two major models of random porous media were reconstructed by computerized tomography method: Randomly distributed rectangular obstacles in a uni...
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 14 شماره
صفحات -
تاریخ انتشار 1999